ANONYMOUS ASSERTIONS

Lazy Assertions

Assertions test expected properties of run-time values without dissrupting the normal working of a program. So in a lazy functional language assertions should be lazy — not forcing evaluation, but only examining what is evaluated by other parts of the program. We describe two different ways of embedding lazy assertions in Haskell, one sequential and the other concurrent. Examples illustrate the...

Paraconsistent Assertions

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an explosion. We argue that paraconsistent logics are especially advantageous in order to deal with assertions made by intelligent agents. Other propositional attitudes like knowledge and beliefs can in principle be treated...

Collective Assertions

We introduce the notion of collective assertions for messagepassing-based parallel programs with distributed memory, such as those written using the Message Passing Interface. A single collective assertion comprises a set of locations in each process and an expression on the global state. The semantics are defined as follows: whenever control in a process reaches one of the locations, a “snapsh...

Applicative Assertions

We present a way of introducing and manipulating assertions in an applicative language, mainly for use in transformational program development. It turns out that this can be achieved wholly within the language itself. The advantage of this is twofold: One has the full power of the language in formulating the assertions, hence decreasing problems with expressiveness. Second, the algebraic laws o...

JaWa: Java with Assertions